Parallel computable higher type functionals (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
Some Applications of Recursive Functionals to the Foundations of Mathematics and Physics
We consider two applications of recursive functionals. The first application concerns Gödel’s theory T , which provides a rudimentary foundation for the formalization of mathematics. T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0N, the successor function S, and the operator Rτ for primitive recursion on objects of type τ . It is kn...
متن کاملAbout and around Computing over the Reals
Computation Procedures • Abstract Computation Procedures (ACPs), (Feferman 1992); should have been called Abstract Recursion Procedures. • Here structures are specified by (possibly) manysorted domains, individual constants, partial functions, and partial monotonic functionals of type level 2. ACP Computable Functions and Functionals • The ACP schemata are given by Explicit Definition in type l...
متن کاملA Construction of Typed Lambda Models Related to Feasible Computability
In this paper we develop an approach to the notion of computable functionals in a very abstract setting not restricted to Turing or, say, polynomial computability. We assume to start from some basic class of domains and a basic class of functions deened on these domains. (An example may be natural numbers with polytime computable functions). Then we deene what are \all" corresponding functional...
متن کاملParallel computable higher type functionals - Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
The primary aim of this paper is to introduce higher type analogues of some familiar parallel complexity classes, and to show that these higher type classes can be characterized in significantly different ways. Recursion-theoretic, proof-theoretic and machine-theoretic characterizations are given for various classes, providing evidence of their naturalness. In this section, we motivate the appr...
متن کاملFeasible functionals and intersection of ramified types
We show that the basic feasible functions of Cook and Urquhart’s BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type intersection (for tier-variants of a common type). This further confirms the stability of BFF as a notion of computational feasibility in higher type. It also suggests the potential usefulness of type-intersection restricted...
متن کامل